Suffix-Sorting via Shannon-Fano-Elias Codes
نویسندگان
چکیده
منابع مشابه
Dynamic Elias-Fano Representation
We show that it is possible to store a dynamic ordered set S(n, u) of n integers drawn from a bounded universe of size u in space close to the information-theoretic lower bound and yet preserve the asymptotic time optimality of the operations. Our results leverage on the EliasFano representation of S(n, u) which takes EF(S(n, u)) = ndlog u ne+ 2n bits of space and can be shown to be less than h...
متن کاملAsymptotic Average Redundancy of Huffman (and Shannon-Fano) Block Codes
We study the redundancy of Huffman code (which, incidentally, is as old as the author of this paper). It has been known from the inception of this code that in the worst case Huffman code redundancy defined as the excess of the code length over the optimal (ideal) code length is not more than onc. Over more than forty years, insightful, elegant and useful constructions have been set up to deter...
متن کاملIn-Place Suffix Sorting
Given string T = T [1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T [i, . . . , n] for all i. This problem is central to the construction of suffix arrays and trees with many applications in string processing, computational biology and compression. A bottleneck in these applications is the amount of workspace needed to perform suffix sorting beyond the spac...
متن کاملFaster suffix sorting
We propose a fast and memory efficient algorithm for lexicographically sorting the suffixes of a string, a problem that has important applications in data compression as well as string matching. Our algorithm eliminates much of the overhead of previous specialized approaches while maintaining their robustness for all kinds of input. For input size n, our algorithm operates in only two integer a...
متن کاملNotes on Suffix Sorting
We study the problem of lexicographically sorting the suffixes of a string of symbols. In particular, we analyze the time complexity of Sadakane’s suffix sorting algorithm [8], showing that this is O(n log n) in the worst case. We also give a small improvement in the space requirements of this algorithm. We conclude that Sadakane’s algorithm, which has previously been shown to outperform the cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2010
ISSN: 1999-4893
DOI: 10.3390/a3020145